Brief Announcement: Practical Synchronous Byzantine Consensus
نویسندگان
چکیده
This paper presents new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using n = 3f + 1 replicas. We improve the Byzantine fault tolerance to n = 2f + 1 by utilizing the synchrony assumption. Our protocol also solves synchronous authenticated Byzantine agreement in fewer expected rounds than the best existing solution (Katz and Koo, 2006). 1998 ACM Subject Classification C.2.4
منابع مشابه
Brief Announcement: A Leader-free Byzantine Consensus Algorithm
We consider the consensus problem in a partially synchronous system with Byzantine faults. In a distributed system of n processes, where each process has an initial value, Byzantine consensus is the problem of agreeing on a common value, even though some of the processes may fail in arbitrary, even malicious, ways. It is shown in [11] that — in a synchronous system — 3t + 1 processes are needed...
متن کاملPractical Synchronous Byzantine Consensus
We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using 3f + 1 replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance to n = 2f + 1 b...
متن کاملA Leader-Free Byzantine Consensus Algorithm
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not the case of benign faults, which raises the following fundamental question: is it possible to design a deterministic Byzantine consensus alg...
متن کاملBrief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
The tuple space coordination model, originally introduced in the Linda programming language [2], uses a shared memory object called a tuple space to support coordination that is decoupled both in time – processes do not have to be active at the same time – and space – processes do not need to know each others’ addresses. The tuple space can be considered to be a kind of storage that stores tupl...
متن کاملConstant-Space Localized Byzantine Consensus
Adding Byzantine tolerance to large scale distributed systems is considered non-practical. The time, message and space requirements are very high. Recently, researches have investigated the broadcast problem in the presence of a f̀ -local Byzantine adversary. The local adversary cannot control more than f̀ neighbors of any given node. This paper proves sufficient conditions as to when the synchro...
متن کامل